Dynamic assignment based on a probabilistic matching: Application to server-container assignment

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Application of a simulation-based dynamic traffic assignment model

The paper presents the calibration and application of a simulation-based dynamic traffic assignment (DTA) model on a portion of the City of Calgary road network in Alberta, Canada. The DTA model iteratively re-assigns flow to paths using the Method of Successive Averages (MSA), based on travel times obtained with a traffic simulation model. The original sub-network extracted from a regional pla...

متن کامل

Dynamic Server Assignment in Multiclass Queues with Shifts, with Application to Nurse Staffing in Emergency Departments

Many service systems are staffed by workers who work in shifts. In this work, we study the dynamic assignment of servers to different areas of a service system at the beginning of discrete time-intervals, i.e., shifts. The ability to reassign servers at discrete intervals introduces a partial flexibility (as opposed to full flexibility under continuous reassignment) that provides an opportunity...

متن کامل

Probit-Based Traffic Assignment: A Comparative Study between Link-Based Simulation Algorithm and Path-Based Assignment and Generalization to Random-Coefficient Approach

Probabilistic approach of traffic assignment has been primarily developed to provide a more realistic and flexible theoretical framework to represent traveler’s route choice behavior in a transportation network. The problem of path overlapping in network modelling has been one of the main issues to be tackled. Due to its flexible covariance structure, probit model can adequately address the pro...

متن کامل

Impossibilities for probabilistic assignment

We consider the problem of assigning objects probabilistically among a group of agents who may have multi-unit demands. Each agent has linear preferences over the (set of) objects. The most commonly used extension of preferences to compare probabilistic assignments is by means of stochastic dominance, which leads to corresponding notions of envy-freeness, efficiency, and strategy-proofness. We ...

متن کامل

On Calibration and Application of Logit-Based Stochastic Traffic Assignment Models

There is a growing recognition that discrete choice models are capable of providing a more realistic picture of route choice behavior. In particular, influential factors other than travel time that are found to affect the choice of route trigger the application of random utility models in the route choice literature. This paper focuses on path-based, logit-type stochastic route choice models, i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Procedia Computer Science

سال: 2020

ISSN: 1877-0509

DOI: 10.1016/j.procs.2020.09.002